Hamiltonian cycles through a linear forest
نویسندگان
چکیده
Let G be a graph of order n. A graph is linear forest if every component is a path. Let S be a set of m edges of G that induces a linear forest. An edge xy ∈ E(G) is called an S-edge if xy ∈ S. An S-edge-length of a cycle in G is defined as the number of S-edges that it contains. We prove that if the degree sum in G of every pair of nonadjacent vertices of G is at least n + m, then G contains hamiltonian cycles of every S-edge-length between 0 and |S|. AMS 2000 Mathematics Subject Classification. 05C38.
منابع مشابه
Linear forests and ordered cycles
A collection L = P 1 ∪ P 2 ∪ · · · ∪ P t (1 ≤ t ≤ k) of t disjoint paths, s of them being singletons with |V (L)| = k is called a (k, t, s)-linear forest. A graph G is (k, t, s)ordered if for every (k, t, s)-linear forest L in G there exists a cycle C in G that contains the paths of L in the designated order as subpaths. If the cycle is also a hamiltonian cycle, then G is said to be (k, t, s)-o...
متن کاملSymmetry group, Hamiltonian equations and conservation laws of general three-dimensional anisotropic non-linear sourceless heat transfer equation
In this paper Lie point symmetries, Hamiltonian equations and conservation laws of general three-dimensional anisotropic non-linear sourceless heat transfer equation are investigated. First of all Lie symmetries are obtained by using the general method based on invariance condition of a system of differential equations under a prolonged vector field. Then the structure of symmetry ...
متن کاملBifurcation of limit cycles from a quadratic reversible center with the unbounded elliptic separatrix
The paper is concerned with the bifurcation of limit cycles in general quadratic perturbations of a quadratic reversible and non-Hamiltonian system, whose period annulus is bounded by an elliptic separatrix related to a singularity at infinity in the poincar'{e} disk. Attention goes to the number of limit cycles produced by the period annulus under perturbations. By using the appropriate Picard...
متن کاملPancyclic graphs and linear forests
Given integers k, s, t with 0 ≤ s ≤ t and k ≥ 0, a (k, t, s)-linear forest F is a graph that is the vertex disjoint union of t paths with a total of k edges and with s of the paths being single vertices. If the number of single vertex paths is not critical, the forest F will simply be called a (k, t)-linear forest. A graph G of order n ≥ k + t is (k, t)-hamiltonian if for any (k, t)-linear fore...
متن کاملPaths and cycles with many colors in edge-colored complete graphs
In this paper we consider properly edge-colored complete graphs, i.e. two edges with the same color cannot share an endpoint, so each color class is a matching. A proper edge-coloring is a factorization if each color class is a perfect or near perfect matching. A subgraph is called rainbow if its edges have different colors. We show that in any factorization of the complete graph Kn on n vertic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004